Lower Bounds for Multicast Message Authentication
نویسندگان
چکیده
Message integrity from one sender to one receiver is typically achieved by having the two parties share a secret key to compute a Message Authentication Code (MAC). We consider the “multicast MAC”, which is a natural generalization to multiple receivers. We prove that one cannot build a short and efficient collusion resistant multicast MAC without a new advance in digital signature design.
منابع مشابه
Cluster Based Secure Data Broadcast of CLAODV Protocol for MANET
Ad-hoc Networks are using multicast protocol to broadcast the messages. Multicast authentication in ad-hoc networks are very challenging based on below mentioned multiple factors such as nodes have limited computing, bandwidth, and energy resources. Additionally, frequent packet loss errors require a security solution that can tolerate missed packets. The existing cryptography techniques are in...
متن کاملMessage Authentication Schemes for Secure Multicasting
Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide sound security mechanism for multicast communication. One such solution, secure multicast, is appealing because it leverages the efficiency of multicast data delivery. However, it also presents several research challenges. In this paper, we discuss a packet source authenticati...
متن کاملSecure Authentication of Multicast protocol for Ad-Hoc Networks
multicast stream authentication and signing is an important and challenging problem.applications such astroop coordination in a combat field, situational awareness, etc.the main challenges are fourfold.first,authenticity must be guaranteed even when only the sender of the data is trusted. Second, unguaranteed connectivity to trusted authorities make known solutions for wired and single hop wire...
متن کاملComputational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by algorithmic problems in the domain of information security, we study the complexity of a new class of computations over sets of elements. In this paper, we introduce hierarchical data processing, a generic class of problems for which, broadly speaking, the computation of a collection of output values from an input set of n elements is fully described by a directed acyclic graph (DA...
متن کاملA Flexible Approach to Embedded Network Multicast Authentication
Distributed embedded systems are becoming increasingly vulnerable to attack as they are connected to external networks. Unfortunately, they often have no built-in authentication capability. Multicast authentication mechanisms required to secure embedded networks must function within the unique constraints of these systems, making it difficult to apply previously proposed schemes. We propose an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001